High Performance Elliptic Curve GF(2m) Crypto-processor
نویسندگان
چکیده
منابع مشابه
Elliptic Curve Crypto-processor
In this paper, we propose an elliptic curve key generation processor over GF(2 163 ) scheme based on the Montgomery scalar multiplication algorithm. The new architecture is performed using polynomial basis. The Finite Field operations use a cellular automata multiplier and Fermat algorithm for inversion. For real time implementation, the architecture has been tested on an ISE 9.1 Software using...
متن کاملA power-optimized low-energy elliptic-curve crypto-processor
This paper presents a low-energy prime-field elliptic-curve cryptography (ECC) hardware processor, suitable for low-power and/or energy-efficient applications and systems. The ECC processor is obtained by power-optimizing a previously reported design. The optimization is performed by making the power consumption profile of the processor as uniform as possible, in an attempt to increase the seco...
متن کاملCompact and Scalable Elliptic Curve Crypto Processor in Binary Field
Elliptic Curve Cryptography plays a vital role in securing the information for the past two decades. Implementing ECC in hardware is more efficient than software. A processor is said to be compact, if its implementation space is small compared to its execution speed and is scalable if this processor is used with different key sizes. Different metrics such as execution time, implementation space...
متن کاملVLSI core architecture for GF(p) elliptic curve crypto processor
A novel GF(p) crypto processor core architecture is presented in this paper. The core is used to implement GF(p) Elliptic Curve Cryptosystem (ECC). The architecture is such that a single core can be used to implement ECC or alternatively a two core solution can be adopted. As a result, the core architecture allows the exploitation of the parallelism that exists in elliptic curve point addition ...
متن کاملA High Performance Reconfigurable Elliptic Curve Processor for GF(2m)
This work proposes a processor architecture for elliptic curves cryptosystems over fields GF (2 m). This is a scalable architecture in terms of area and speed that exploits the abilities of reconfigurable hardware to deliver optimized circuitry for different elliptic curves and finite fields. The main features of this architecture are the use of an optimized bit-parallel squarer, a digit-serial...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Technology Journal
سال: 2006
ISSN: 1812-5638
DOI: 10.3923/itj.2006.742.748